A note on r-dominating cliques
نویسندگان
چکیده
منابع مشابه
r-Dominating cliques in graphs with hypertree structure
Let G = (V, E) be an undirected graph and r be a vertex weight function with positive integer values. A subset (clique) D ~_ V is an r-dominat ing set (clique) in G ifffor every vertex v e V there is a vertex u e D with dist(u, v) <~ r(v). This paper contains the following results: (i) We give a simple necessary and sufficient condition for the existence of r-dominating cliques in the case of H...
متن کاملDominating cliques in graphs
A set of vertices is a dominating set in a graph if every vertex not in the dominating set is adjacent to one or more vertices in the dominating set. A dominating clique is a dominating set that induces a complete subgraph. Forbidden subgraph conditions sufficient to imply the existence of a dominating clique are given. For certain classes of graphs, a polynomial algorithm is given for finding ...
متن کاملA note on cliques and independent sets
For integers m,n ≥ 2, let f(m,n) be the minimum order of a graph where every vertex is in both a clique of cardinality m and an independent set of cardinality n. We show that f(m,n) = d( √ m− 1 + √ n− 1)2e. In this paper we use the terminology of [1]. Specifically, graph G has vertex set V (G), edge set E(G) and order p = |V (G)|. Also, N(v) denotes the neighborhood of a vertex v, i.e., the set...
متن کاملA Note on Non-dominating Ultrafilters
We show that if cov(M) = κ, where κ is a regular cardinal such that ∀λ < κ(2 ≤ κ), then for every unbounded directed family H of size κ there is an ultrafilter UH such that the relativized Mathias forcing M(UH) preserves the unboundedness of H. This improves a result of M. Canjar (see [4, Theorem 10]). We discuss two instances of generic ultrafilters for which the relativized Mathias forcing pr...
متن کاملDominating Cliques in Distance-Hereditary Graphs
1 I n t r o d u c t i o n A subset D C V is a dominating set in graph G = (V, E) iff for all vertices v E V \ D there is a vertex u E D with uv E E. It is a dominating clique in G iff D is a dominating set in G and a clique (i.e. for all u, v E D uv E E). There are many papers investigating the problem of finding minimum dominating sets in graphs with (and without) additional requirements to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00076-9